|
Timothy Avelin Roughgarden is an Associate professor in the Computer Science and Management Science and Engineering Departments at Stanford University.〔(【引用サイトリンク】url=http://theory.stanford.edu/~tim/ )〕 Tim received his Ph.D. at Cornell University in 2002, where his PhD was supervised by Éva Tardos. Roughgarden teaches a popular two-part Algorithms course on Coursera. In those two courses, his ease of delivery, along with the compact information delivered in a rational style of building blocks has gained his course a reputation for being one of the best preparations for technical job interviews at big computer software companies like Google, Facebook, Amazon, and Microsoft. Roughgarden’s work is concerned with game theoretic questions in computer science. He received the Danny Lewin award at STOC 2002 for the best student paper. He received the Grace Murray Hopper Award in 2009 and the Gödel Prize in 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network. == Selected publications == * * * 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Tim Roughgarden」の詳細全文を読む スポンサード リンク
|